Quantum Data Aggregation Using Secret Sharing and Genetic Algorithm
نویسندگان
چکیده
منابع مشابه
Quantum Secret Sharing with Grover’s Algorithm
Quantum secret sharing addresses the same problem that classical secret sharing does, but via quantum means. That is, Alice wishes to send a secret to n agents, and any k ≤ n agents can collaborate to recover the secret. However, for any fewer than k agents, collaboration will information-theoretically reveal no information about the secret. Such protocols are called (k,n)threshold schemes, and...
متن کاملCircular quantum secret sharing
Fu-Guo Deng, Hong-Yu Zhou, and Gui Lu Long † 1 The Key Laboratory of Beam Technology and Material Modification of Ministry of Education, Beijing Normal University, Beijing 100875, China 2 Institute of Low Energy Nuclear Physics, and Department of Material Science and Engineering, Beijing Normal University, Beijing 100875, China 3 Beijing Radiation Center, Beijing 100875, China 4 Key Laboratory ...
متن کاملGeneralized Quantum Secret Sharing
We explore a generalization of quantum secret sharing (QSS) in which classical shares play a complementary role to quantum shares, exploring further consequences of an idea first studied by Nascimento, Mueller-Quade and Imai (Phys. Rev. A64 042311 (2001)). We examine three ways, termed inflation, compression and twin-thresholding, by which the proportion of classical shares can be augmented. Th...
متن کاملMultiparty Quantum Secret Sharing
Based on a quantum secure direct communication (QSDC) protocol [Phys. Rev. A69(04)052319], we propose a (n, n)-threshold scheme of multiparty quantum secret sharing of classical messages (QSSCM) using only single photons. We take advantage of this multiparty QSSCM scheme to establish a scheme of multiparty secret sharing of quantum information (SSQI), in which only all quantum information recei...
متن کاملAssisted Quantum Secret Sharing
A restriction on quantum secret sharing (QSS) that comes from the no-cloning theorem is that any pair of authorized sets in an access structure should overlap. From the viewpoint of application, this places an unnatural constraint on secret sharing. We present a generalization, called assisted QSS (AQSS), where access structures without pairwise overlap of authorized sets is permissible, provid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3026238